Constraint-Coupled Distributed Optimization: A Relaxation and Duality Approach
نویسندگان
چکیده
منابع مشابه
Constraint Coupled Distributed Optimization: Relaxation and Duality Approach
In this paper we consider a distributed optimization scenario in which agents of a network want to minimize the sum of local convex cost functions, each one depending on a local variable, subject to convex local and coupling constraints, with the latter involving all the decision variables. We propose a novel distributed algorithm based on a relaxation of the primal problem and an elegant explo...
متن کاملA Distributed Constraint Optimization Approach to Wireless Network Optimization
We present a new algorithm called Variable Message Size (VMS) ADOPT for solving Distributed Constraint Optimization Problems (DCOP) which trades off message size and memory usage for running time. The algorithm is applied to a wireless network optimization problem, in which small robots act as wireless routers with the objective of maximizing signal strength in the network by repositioning them...
متن کاملA duality-based approach for distributed min-max optimization
In this paper we consider a distributed optimization scenario in which a set of processors aims at cooperatively solving a class of min-max optimization problems. This set-up is motivated by peakdemand minimization problems in smart grids. Here, the goal is to minimize the peak value over a finite horizon with: (i) the demand at each time instant being the sum of contributions from different de...
متن کاملConstraint Relaxation in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (DCSP) formulation has recently been identi ed as a general framework for formalizing various Distributed Arti cial Intelligence problems. In this paper, we extend the DCSP formalization by introducing the notion of importance values of constraints. With these values, we de ne a solution criterion for DCSPs that are over-constrained (where no solu...
متن کاملDuality in Optimization and Constraint Satisfaction
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, surrogate, Lagrangean, superadditive, and constraint duals, as well as duals defined by resolution and filtering algorithms. Inference duals give rise to nogood-based search methods and sensitivity analysis, while relax...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Control of Network Systems
سال: 2020
ISSN: 2325-5870,2372-2533
DOI: 10.1109/tcns.2019.2925267